Model and subsystem function signatures

ABSTRACT

A system and method enable a user to specify function signatures for automated code generators to generate code based on a model representation. The method for automatically generating a function based on the model representation includes providing at least a portion of the model representation. A function signature is received for the model representation. The function signature is generated by a user. The function is generated based on the model representation and the function signature. A user interface can be provided to enable the user to enter the function signature and also to present a preview of a function that results from the function signature as modifications are made to the function signature. The user can enter the function signature using regular expressions, if desired.

CROSS REFERENCES

This application is a continuation of U.S. patent application Ser. No. 10/737,997 filed Dec. 16, 2003, now U.S. Pat. No. 7,823,122, issued on Oct. 26, 2010 titled, “Model and Subsystem Function Signatures,” by the present applicant.

FIELD OF THE INVENTION

The present invention relates to automated code generators for transforming hierarchical block diagrams, or other graphical or otherwise hierarchical modeling structures, into software code, and more particularly to a system and method for specifying the function signature of an automatically generated function, and providing a preview of the automatically generated function.

BACKGROUND OF THE INVENTION

Dynamic systems are typically modeled in simulation environments as sets of differential, difference, and/or algebraic equations. At any given instant of time, these equations may be viewed as relationships between the system's output response (“outputs”), the system's input stimuli (“inputs”) at that time, the current state of the system, the system parameters, and time. The state of the system may be thought of as a numerical representation of the dynamically changing configuration of the system. For instance, in a physical system modeling a simple pendulum, the state may be viewed as the current position and velocity of the pendulum. Similarly, a signal-processing system that filters a signal would maintain a set of previous inputs as the state. The system parameters are the numerical representation of the static (unchanging) configuration of the system and may be viewed as constant coefficients in the system's equations. For the pendulum example, a parameter is the length of pendulum and for the filter example; a parameter is the values of the filter taps.

There are four common types of mathematical models used in the study of dynamic systems. The first type of mathematical model describes systems using ordinary differential equations (ODEs) and is depicted in FIG. 1A. The dynamic system 2 specifies a set of two equations: Output 4 and Derivative 6. The Output equation 4 facilitates the computation of the system's output response at a given time instant as a function of its inputs, states, parameters, and time. The Derivative equation 6 is an ordinary differential equation that allows the computation of the derivative of the states at the current time as a function of the inputs, the states, parameters, and time. This class of models is suitable for systems in which it is important to track the system response as a continuous function of time. Such continuous-time systems are commonly representative of physical systems (mechanical, thermal, electrical). For simple systems, it may be possible to use the Output 4 and Derivative equations 6 to obtain a closed-form solution for the output response y(t). But in most complex real world systems, the response of the system is obtained by integrating the states through numerical means.

The definition of an ODE used herein encompasses both implicit and explicit differential equations. The class of ordinary differential equations may require additional equations to define the system being modeled. For example, equations called projections may be required to impose constraints on the differential variables (e.g., states X₁ and X₂ must fall on the manifold defined by X₁ ²+X₂ ²=25). These constraints can be either applied as a secondary condition or a coupled condition to the differential equation. Although systems including the projections may conventionally no longer qualify as an ODE; they are included here to simplify the categories of systems. Another example is the use of a Jacobian equation that defines partial derivatives with respect to the independent and/or differential variables. The Jacobian equation is typically used when obtaining a linear approximation of a non-linear model or an overall linear model of a set of equations. Jacobian equations are required for some forms of numerical integration, for producing the linear model once the model has reached its steady state operating point, etc. The Output 4 and Derivatives equations 6 may be extended to define other relationships for the block. For example, the Output equation 4 may help manage its states by defining a relationship where it resets the state back to a known quantity at a specific point in time or when a specific condition is seen.

Another type of mathematical model describes systems using difference equations as depicted in FIG. 1B. The dynamic system 8 specifies a set of two equations: Output 10 and Update 12. The Output equation 10 facilitates the computation of the system's output response at a given time instant as a function of the inputs, states at some previous time, parameters, and time. The Update equation 12 is a difference equation that allows the computation of the states at the current time as a function of the inputs, states at some previous time, parameters, and time. This class of models is suitable for systems in which it is important to track the system response at discrete points in time. Such discrete-time systems are commonly representative of discrete-time control and digital signal processing systems. For simple systems, it may be possible to use the Output 10 and Update equations 12 to obtain a closed-form solution for the output response y(t). But in most complex real world systems, the response of the system is solved through recursion. The Output 10 and Update equations 12 are applied repeatedly to solve for the system response over a period of time.

An additional type of mathematical model describes systems using algebraic equations as depicted in FIG. 1C. The dynamic system 14 uses an algebraic equation 16 that needs to be solved at each time to obtain the outputs. While simple systems may allow one to obtain a closed-form solution for the system inputs and outputs, practical algebraic equations may best be solved iteratively using a numerical method involving both perturbations and iterations. Algebraic equation solving techniques used in the context of dynamic system modeling are discussed in greater detail below.

A fourth type of mathematical model is a composite system that has components that fall into the three types of models discussed above. Most complex real-world system models fall into this category. This class of systems has Output, Derivative, Update, and potentially other equations. Solving for the output response of such systems requires a combination of the solution approaches discussed for all of the classes above. One example of a composite system is one described by differential-algebraic equations (DAEs) which contain both differential equations and algebraic equations. Grouped within the composite class of systems are many extensions involving relationships (equations) defined in terms of both outputs and state. For example, one can define a limited integration relationship for a differential variable. This relationship requires a set of equations that includes the Output equation, an Update equation, a Derivative equation, and a Zero-crossing equation. The Zero-crossing equation defines the points in time where the upper and lower limits of the limited integration occur. Another example of an extension is the notion of Enable and Disable equations that define relationships among states or signals when parts of a system are activated and deactivated during execution.

Inherent in the four classes of systems (ODE, difference equations, algebraic equations and composite) is the notion of system sample time. The sample time is the time interval at which the inputs, state, or outputs (collectively referred to as the results) of the system are traced as time progresses. Based on sample times, a system can be described as a discrete-time system, continuous-time system and hybrid system. A discrete-time system is a system in which the evolution of the system results are tracked at finite intervals of time. In the limit as the interval approaches zero, the discrete-time system becomes a continuous-time system. The intervals of time may be periodic or non-periodic. Sometimes, non-periodic rate systems are referred to as non-uniform rate systems meaning that there is no periodic rate at which the response can be tracked. Non-uniform-rate systems can fall into the class of composite systems where an additional equation (GetTimeOfNextVarHit) defines when in the future the other equations associated with the system should be evaluated. A continuous-time system is a system in which the evolutions of the system results are continuously changing. Continuous-time signals change during numerical integration (minor time steps). An example of a continuous-time system is one described by an ODE. There can also be algebraic or composite continuous-time systems. A hybrid system is a system with both discrete-time and continuous-time elements.

If a system has only one sample time, it is said to be single-rate. If a system has multiple sample times, it is said to be multi-rate. Multi-rate systems can be evaluated (executed) using either a single-tasking form of execution or a multi-tasking form of execution. When multi-tasking execution is used, it conforms to rate monotonic scheduling principals as defined by LIU, C. L., and LAYLAND, J. W. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. ACM 20, 1 (January 1973), 46-61. Systems may also be categorized by the type of numerical integration solver being used. A fixed-step system is one that uses a fixed-step solver. Fixed-step solvers typically use explicit methods to compute the next continuous state at fixed periodic intervals of time. A variable-step system is one that is using a variable-step solver. A variable-step solver can use either implicit or explicit methods to compute the next continuous state at non-periodic intervals of time. Generally, variable-step solvers use a form of error control to adjust the interval size such that the desired error tolerances are achieved.

In practice, except for the most basic systems, mathematical models for dynamic systems involve a complex set of mathematical transformations applied in some prescribed manner with the outputs of some transformations forming the inputs of others. Each elemental transformation may be viewed in isolation as a simple dynamic system falling into one of the categories listed above. Therefore, a complex dynamic system may be modeled as an interconnection of various simple dynamic systems. A schematic representation of such an interconnection that has evolved over the years is the block diagram. Such block diagram models have now become a standard means in textbooks, design papers, journal articles, and specifications to communicate the details of a dynamic system's behavior.

A block diagram model of a dynamic system is represented schematically as a collection of blocks interconnected by lines that represent signals. A signal represents the input and output of a dynamic system. Each block represents an elemental dynamic system. A line emanating at one block and terminating at another signifies that the output of the first block is an input to the second block. Each distinct input or output on a block is referred to as a port. Signals correspond to the time-varying quantities represented by each line connection and are assumed to have values at each time instant. The source block of a signal writes to the signal at a given time instant when its system equations are solved. The destination blocks of this signal read from the signal when their system equations are being solved. The basic components of a block diagram are illustrated in FIG. 2. The block diagram includes a plurality of blocks 20, lines 22 and ports 24 that are interconnected. Those skilled in the art will recognize that the term “blocks” does not refer exclusively to elemental dynamic systems but may also include other modeling elements that aid in readability and modularity of block diagrams.

The theory of Digital Signal Processing (DSP) focuses on modeling signals as sequences of samples. This view naturally fits into the time-based block diagram paradigm by mapping the samples u[n] to discrete-time points u(t_(k)). This adds the benefit of being able to model the interaction between DSP systems and other classes of time-based systems, e.g. continuous and/or discrete-time control systems.

Put another way, block diagram models are time-based relationships between signals and state variables representative of a dynamic system. The solution (computation of system response) of the model is obtained by evaluating these relationships over time, where time starts at a user-specified “start time” and ends at a user-specified “stop time”. Each evaluation of these relationships is referred to as a time step. Signals represent quantities that change over time, and these quantities are defined for all points in time between the block diagram's start and stop time. The relationships between signals and state variables are defined by sets of equations represented by blocks. These equations define a relationship between the input signals, output signals, state, and time. Inherent in the definition is the notion of parameters, which are the coefficients of the equations.

It is important to note that block diagrams are not exclusively used for representing time-based dynamic systems but also for other models of computation. For instance, flow-charts are block diagrams used to capture process flow and are not generally suitable for describing dynamic system behavior. Data flow block diagrams are block diagrams that describe a graphical programming paradigm where the availability of data (often thought of as tokens) is used to initiate the execution of blocks, where a block represents an operation and a line represents execution dependency describing the direction of data flowing between blocks. As used herein, the term block diagrams means time-based block diagrams used in the context of dynamic systems except as otherwise noted.

Block diagram modeling has spawned a variety of software products such as Simulink® from the MathWorks, Inc. of Natick, Mass., that cater to various aspects of dynamic system analysis and design. Such products allow users to perform various types of tasks including constructing system models through a user-interface that allows drafting block diagram models, allowing augmentation of a pre-defined set of blocks with custom user-specified blocks, the use of the block diagram model to compute and trace the temporal evolution of the dynamic system's outputs (“executing” the block diagram), and automatically producing either deployable software systems or descriptions of hardware systems that mimic the behavior of either the entire model or portions of it (referred to herein as “code generation”). Each of the tasks listed above has many intricate details and subtle variations that are explored further below.

Block modeling software includes a number of generic components. Although the discussion contained herein focuses on Simulink® version 5.0 (Release 13) from the MathWorks, Inc. of, Natick Mass., those skilled in the art will recognize that it is applicable to other block modeling software applications. The generic components include a block diagram editor, blocks and a block diagram execution engine. The block diagram editor allows users to perform such actions as draw, edit, annotate, save, and print out block diagram representations of dynamic systems. As noted earlier, blocks are the fundamental mathematical elements of a classic block diagram model. Simulink® extends the classic block diagram models by introducing the notion of two classes of blocks, non-virtual blocks and virtual blocks. Non-virtual blocks are elementary dynamic systems. A virtual block is provided for graphical organizational convenience and plays no role in the definition of the system of equations described by the block diagram model. Examples of virtual blocks are the Bus Creator virtual block and Bus Selector virtual block which are used to reduce block diagram clutter by managing groups of signals as a “bundle”. Virtual blocks may be used to improve the readability of models. Simulink® further extends the meaning of a non-virtual block to include other semantics, such as a “merge” block semantic. The merge block semantic is such that on a given time step its output is equal to the last block to write to an input of the merge block. An additional extension provided by Simulink® is the concept of conditional execution. Simulink® contains the concept of conditional and iterative sub-systems that control when in time block methods execute for a sub-section of the overall block diagram.

A block diagram execution engine contributes to the modeling software task of enabling the computation and tracing of a dynamic system's outputs from its block diagram model. An execution engine carries out the task of compiling and linking the block diagram to produce an “in-memory executable” version of the model that is used for generating code and/or simulating or linearizing a block diagram model. Note that execution of the block-diagram is also referred to as simulation. The compile stage involves checking the integrity and validity of the block interconnections in the block diagram. In this stage, the engine also sorts the blocks in the block diagram into hierarchical lists that are used when creating the block method execution lists. In the link stage, the execution engine uses the result of the compiled stage to allocate memory needed for the execution of the various components of the block diagram. The linking stage also produces block method execution lists that are used by the simulation or linearization of the block diagram. Included within the link stage is the initialization of the model which includes the evaluating of “setup” methods (e.g. block start, initialize, enable, and constant output methods). The block method execution lists are generated because the simulation and/or linearization of a model must execute block methods by type (not by block) when they have a sample hit.

After linking has been performed, the execution engine may generate code. In this stage, the execution engine may choose to translate the block diagram model (or portions of it) into either software modules or hardware descriptions (broadly termed code). If this stage is performed, then the stages that follow use the generated code during the execution of the block diagram. If this stage is skipped completely, then the execution engine uses an interpretive mode of execution for the block diagram. In some cases, the user may not proceed further with the execution of the block diagram because they would like to deploy the code outside the confines of the block diagram software. Upon reaching the simulation stage, the execution engine uses a simulation loop to execute block methods in a pre-defined ordering upon a sample hit to produce the system responses as they change with time.

For linearization, Simulink® uses the block method execution lists in a prescribed fashion to produce a linear state space representation of the dynamic system described by the block diagram.

The block diagram editor is the graphical user interface (GUI) component that allows drafting of block diagram models by a user. In Simulink®, there is also a textual interface with a set of commands that allow interaction with the graphical editor. Using this textual interface, users may write special scripts that perform automatic editing operations on the block diagram. A user generally interacts with a set of windows that act as canvases for the model. There is generally more than one window for a model because models may be partitioned into multiple hierarchical levels through the use of sub-systems (discussed further below).

A suite of GUI tools in Simulink® allows users to draft a block diagram model on the corresponding windows. The GUI tools include a block palette, wiring line connection tool, annotation tool, formatting tool, attribute editing tool, save/load tool and publishing tool. The block palette is a library of all the pre-defined blocks available to the user when they are building the block diagram. Individual users may be able to customize this palette to: (a) reorganize blocks in some custom format, (b) delete blocks they do not use, and (c) add custom blocks they have designed. The palette allows blocks to be dragged through some human-machine interface (such as a mouse or keyboard) from the palette on to the window (i.e., model canvas). The graphical version of the block that is rendered on the canvas is called the icon for the block. There may be different embodiments for the block palette including a tree-based browser view of all of the blocks.

The wiring line connection tool allows users to draw directed lines that connect the ports of blocks in the model's window. Lines are also added through various mechanisms involving human-machine interfaces such as the mouse or keyboard. Simulink® also provides various forms of auto-connection tools that connect blocks automatically on user request to produce an aesthetically pleasing layout of the block diagram (especially those with high complexity with large numbers of blocks). The annotation tool allows users to add notes and annotations to various parts of the palette for a block diagram. The formatting tool enables users to perform various formatting operations that are generally available on any document editing tool. These operations help pick and modify the various graphical attributes of the block diagram (and constituent blocks) such as include font-selection, alignment & justification, color selection, etc. The block diagram and all the blocks within the block diagram generally have a set of functional attributes that are relevant for the execution or code-generation. The attribute editing tool provides GUIs that allows these attributes to be specified and edited. The save/load tool allows a created block diagram model to be saved. The saved model can be reopened in the editor at some later juncture through a load mechanism. Simulink® also allows users to save blocks including pre-constructed sub-systems into a separate class of block-diagrams called libraries. Such libraries facilitate reuse of the same block in a number of other block diagrams. The load/save mechanism is specially equipped to handle loading and saving of blocks in a block-diagram that actually reside in libraries.

The publishing tool enables the viewing of the block diagram as a document that can be published in any of the standard document formats (examples: PostScript, PDF, HTML, etc.). Those skilled in the art will recognize that the windows for multiple models and all of the tools mentioned above could potentially be embedded in a single Multi-Document Interface (MDI) for providing a unified software environment.

Those skilled in the art will also recognize that block-diagram packages offer scripting languages for writing out programs that automatically carry out a series of operations that would normally require interaction with the GUI. For example, Simulink® offers a set of commands in MATLAB for carrying out operations such as block addition (add_block), block deletion (delete_block), starting and terminating execution (set_param), modifying block attributes (set_param/get_param), etc.

Simulink® also offers a variety of other GUI tools that improve the ability of users to build and manage large block diagrams. Examples of such GUIs include: (a) a Finder that helps find various objects such as blocks and lines within a block-diagram, (b) a Debugger that helps debug the execution of block-diagrams, (c) a Revision Control UI for managing multiple revisions of the block-diagram, and (d) a Profiler for viewing timing results while executing a block-diagram.

A typical base data-structure for a block may be represented as:

class Block {

public:

// Access methods for setting/getting block data

. . .

// Methods for block editing

virtual ErrorStatus BlockDrawIcon( );

virtual BlockParameterData BlockGetParameterData( );

. . .

// Methods for block compilation

. . .

// Methods for block execution

. . .

virtual ErrorStatus BlockOutput( )=0;

virtual ErrorStatus BlockDerivative( )=0;

virtual ErrorStatus BlockUpdate( )=0;

. . .

private:

BlockGraphicalData blkGraphicalAttributes;

BlockFunctionalData blkFunctionalAttributes;

BlockCompiledData blkCompiledAttributes;

BlockExecutionData blkExecutionData;

. . .

};

Although the example of the data structure above is written in C++, those skilled in the art will recognize that equivalent data structures written in other languages may also be used. The major data fields of the block data structure fall into four categories, a graphical attributes field, a functional attributes field, a compiled attributes field and an execution data field.

The graphical attributes field is responsible for storing information relevant for graphical rendering of the block within its parent block diagram's GUI. Attributes specific to the block icon such as font, color, name, and icon-image are stored in this field. It should be noted that modifying these attributes does not affect the dynamics of the model using this block. The functional attributes field is responsible for specifying block attributes that may potentially affect the dynamics of the model using this block. These attributes are specified for the block as a whole and the input and output ports of the block. Examples of block attributes include block sample times and restrictive flags. Block sample times specify if the block corresponds to an elemental, continuous, discrete, or hybrid dynamic system. If the block is an elemental discrete-time system, then the attribute specifies the spacing between time instants at which the block response should be traced. A restrictive flag disallows the use of blocks in certain modeling contexts. For example, one may impose the restriction that there may only be one instance of given block in a model.

Attributes of block ports specify properties of the data that is either available or produced at that port. Block port attributes include dimensions, datatypes, sample rates, and direct feedthrough. Dimension attributes are individual dimensions of a multi-dimensional matrix that is used as a container for data elements. Datatype attributes are the datatype of each element of data in the data container. A complexity attribute is a flag to specify if each data element is real or complex. A sample rate attribute specifies how when the signal corresponding to an input or output port will be used. The port sample times may sometimes be used to implicitly infer the block's sample time. The direct feedthrough attribute is specified only for input ports and indicates whether or not the Output and/or GetTimeOfNextHit equations of the block are a function of the given input. This attribute helps in determining the sequence in which block methods should be executed while executing the block diagram.

The compiled attributes field of the block data structure holds the attributes of the block and its ports that mirror the functional attributes listed above. This field is filled in during block diagram compilation by utilizing the functional attributes of the block in conjunction with the functional and compiled attributes of the blocks that are connected to it. This process of determining the compiled attributes from the functional attributes is termed attribute propagation. Attribute propagation is described in greater detail below in the section on block diagram compilation. The execution data field is mainly responsible for storing the memory locations that are going to serve as sources for block inputs, outputs, states, parameters, and other work areas during execution of blocks.

The block data structure also has a set of associated methods that may be categorized as access methods to data fields, methods used in editing, methods used in compilation and methods used in execution. Access methods to data fields help in setting and getting the various data fields of the block. Methods used in editing are called by the block diagram editor in order to render the block appropriately in the GUI of its parent block diagram. For instance, this set of methods may include a BlockDrawIcon method that determines the shape the block icon has on the GUI. Methods used in compilation are methods that are called by the block diagram compilation engine. They help validate the connections of the block to other blocks on the block diagram. The methods used in execution include a number of different run-time methods that are required for execution. These include the BlockOutput, BlockUpdate, BlockDerivative methods that realize the Output, Update, and Derivative equations discussed earlier in the context of dynamic systems. In addition to these methods, Simulink® includes several other run-time methods, such as the Jacobian, Projection, ZeroCrossings, Enable, Disable, Initialize, EvalParams (check and process parameters), and GetTimeOfNextHit methods. It should be noted that there is no explicit method for algebraic equations because these are represented and processed in a different manner which will be discussed below.

The base data structure for the block specifies the generic fields and interfaces that need to be supported by a block. Some of the methods are purely virtual and have no specific implementation in the base block class. In order to define a specific block (such as an Integrator block), one needs to subclass the base block class and provide explicit definitions for these virtual methods. An example of the subclassing of a block may be seen by examining an Integrator block. FIG. 3 depicts the desired behavior of an Integrator block 30. In order to create the subclass, four major categories of information within the subclass must be specified, the block parameters, the methods used in editing, the methods used in compilation, and the methods used in execution. The elemental dynamic system embodied by the block may be parameterized as illustrated in FIGS. 1A-1C. Each block needs to be able to specify its list of expected parameters. The block diagram editor's Attribute-Editing tool may allow users to specify the parameters for the block when they use it in their models. In the Integrator block example, the block has one parameter that specifies the block's initial condition for the block's state. Regarding the methods used in editing, the subclass needs to specify a method that renders its icon. For example, the Integrator block may implement a method that makes its icon be a box with a “1/s” within the box. Also, the subclass needs to instantiate a method that allows access of the block parameters from the GUI's Attribute-Editing tool. For the Integrator example, this method would allow users to specify the Initial Condition parameter on a GUI for the block. For the methods used in compilation, the subclass needs to instantiate methods that help in the compilation of the block diagram model in which it is placed. These methods help specify the compiled information for the inputs and outputs of the block. For instance, the Integrator block may specify a method that ensures that if the input to the Integrator is a vector, then the output is a vector of the same size. For methods used in execution, the subclass needs to instantiate specific Output, Derivative, and Update methods that represent the block behavior. In the case of the Integrator block, an Output and Derivative method are needed. It should be noted that in Simulink® the Integrator block has additional methods that are not illustrated here. The Output method sets the output to be equal to the state. The Derivative method sets the derivative of the state to be equal to the input.

The specification of these four types of information for the Integrator block subclass may be shown by a reduced form of the Simulink® Integrator block:

IntegratorBlock: public Block {

public:

-   -   ErrorStatus BlockDrawIcon( ){         -   // Draw ‘1/s’ on the icon         -   . . .     -   }         BlockParameterData BlockGetParameterData( )     -   // Return initial_condition as block data     -   . . .

}

ErrorStatus BlockOutput( ){

-   -   // Implement y(t)=x(t)     -   . . .

}

ErrorStatus BlockDerivative( ){

-   -   // Implement dx(t)/dt=u(t)     -   . . .

}

private:

double initial_condition;

};

It should be noted that block diagram software generally provides open access to the block's data structure to users of the software. This allows users to create and utilize custom block implementations in their models.

Blocks in a block diagram may be virtual or non-virtual. The designation of a block as non-virtual indicates that it influences the equations in the mathematical model for the dynamic system. In the context of block diagram software, it is beneficial to include other virtual blocks that do not affect the equations in the dynamic system's model. Such blocks help improve the readability and modularity of the block diagram and wield no semantic influence on the mathematical model. Examples of such virtual blocks include virtual sub-systems, inport blocks and outport blocks, bus creator blocks and From and Goto blocks.

Modularity may be achieved in a block diagram by layering the block diagram through the use of sub-systems. A sub-system facilitates layering by allowing a collection of blocks to be represented by a single block with input and output signals. The input and output signals of the sub-system are accessible to the constituent blocks within the sub-system. A sub-system is a virtual sub-system if its constituent blocks are moved back into the main block diagram model during the model's execution. Within a virtual sub-system graphical entities, called inport and outport blocks, are provided to define signal connections to the parent block diagram. These inport and outport blocks indicate a tunnel-through signal connection to the parent block diagram.

Additional types of virtual blocks include bus creator blocks and selector blocks. In large models, there may be an extensive set of lines that connect one section of a block diagram to another section. To avoid excessive clutter of lines and improve readability, there is typically a special block called a Bus Creator that helps bundle all of the lines together to form a single bus line. This single bus line then connects the two sections of the model. At the destination end of the line, a block called a Bus Selector helps un-bundle the individual lines so that they can be connected to other blocks.

Other virtual blocks include From blocks and Goto blocks that are special blocks that help avoid graphical clutter, e.g. a line that connects two distant sections of a block diagram. The line is terminated close to its originating point by a From block. At the other end, a new line is drawn from a From block that is hot-linked to the Goto block. Each Goto and From block has an associated tag that describes which blocks are connected together. An important point to be noted is that virtual blocks have neither execution data nor execution methods in their data structure.

Simulink® also provides the user with the ability to extend the simulator by providing the ability to enhance the simulator with blocks that define dynamic systems or are virtual properties. The extension is provided through a language independent API (e.g. C, C++, Ada, Fortran, Assembly, M).

As noted previously, to facilitate modeling fairly large and complex dynamic systems, Simulink® allows users to layer their block diagrams. A sub-system facilitates such layering by allowing a collection of blocks to be represented by a single block with input and output signals. The input and output signals of the sub-system are accessible to its constituent blocks. By nesting sub-systems within each other, one can create block diagrams with arbitrary layers of hierarchy. Ideally a sub-system has no impact on the meaning of the block diagram. Additionally, sub-systems provide a way of grouping blocks together and allowing other block diagram constructs to impose unified control on the constituent blocks. To enhance the modularity of sub-systems, modeling software also allows aggregated list(s) of parameters of the blocks within the sub-system to be accessed from a single GUI, and defines and displays special icons on the sub-systems. The process of defining the parameter list and the special icon is called masking a sub-system.

There are two main types of sub-system blocks, virtual sub-systems and non-virtual sub-systems. Virtual sub-systems serve the purpose of providing the block diagram with a graphical hierarchy. Non-virtual sub-systems behave like an elemental dynamic system with its own execution methods (Output, Update, Derivatives, etc.). These execution methods in turn call the execution methods of the constituent blocks.

The classes of non-virtual sub-systems are:

Atomic sub-systems. These are similar to virtual sub-systems, with the advantage of grouping functional aspects of models at a given layer. This is useful in modular design.

Conditionally-executed sub-systems. These are non-virtual sub-systems that execute only when a precondition is fulfilled:

Enabled sub-systems. These are similar to Atomic sub-systems, except that the constituent blocks only execute when an enable signal feeding the sub-system is greater than zero.

Triggered sub-systems. These are similar to Atomic sub-systems, except that the constituent blocks only execute when a rising and/or falling signal is seen on a triggering signal feeding the sub-system.

Enable with Trigger sub-systems. These are an intersection of the properties of Enabled and Triggered sub-systems.

Action sub-systems. These sub-systems are connected to action-initiator (e.g., an “If” or “SwitchCase” block), a block that explicitly commands the sub-system contents to execute. These sub-systems are similar to Enabled sub-systems except that the management of the “enabling” signal has been delegated to an action-initiator. Action sub-systems define a new type of signal, called an action signal that signifies which sub-systems are commanded to execute by the action-initiator.

Function-call sub-systems. These sub-systems provide a means of collecting blocks into a sub-system that is only executed when called by an owner block. The owner block may compute input signals for the sub-system before calling the sub-system. Additionally, the owner may also read output signals from the sub-system after calling it. Function-call sub-systems define a new type of execution control signal, called a function-call signal that contains no data. It is used to define the execution relationship between the owner block and the function-call sub-system. Function-call owners may also designate themselves as an “interrupt” source. In simulation, they simulate the effects of an interrupt and in code generation they can attach themselves to an (asynchronous) interrupt.

While sub-systems and For sub-systems. These sub-systems execute the constituent blocks multiple times on a given time step.

Simulink® allows for several forms of block parameters to be defined. There are two general categories of parameters: those parameters that can be modified during simulation and those that cannot be modified. An example of a parameter that may be modified during simulation is the amplitude of a Sine Wave block if configured by the user to allow modification during execution. A parameter such as the amplitude specifies coefficients of the dynamic equation, in this case the amplitude of the sine wave function defined by the Sine Wave block. An example of a parameter that can never be modified during simulation is the sample time of the Sine Wave block. The parameters that can be modified during simulation are further broken down into other categories which include mapping the dialog parameter (e.g. the amplitude) to run-time parameters or converting the dialog parameter to an inlined (non-modifiable) parameter. Run-time parameters can further be mapped to mathematical expressions of tunable Matlab variables or Matlab parameter objects describing properties of the variables (called Simulink®.Parameter's). A global run-time parameter data structure is used within Simulink® to manage the block parameters during the execution of the model.

In addition to block parameters, there are model-wide parameters that are generally associated with the solver. These parameters include aspects such as the time span in which to perform a simulation, the type of solver, and the time span. Simulink® gives the user the ability to adjust solver parameters during model execution. The adjustment of these solver parameters is performed at the start of a time step.

Once a block diagram model has been constructed using the editor, an execution engine allows the model to be solved in order to trace the system outputs as a function of time. The solution of the model, which may be referred to as model execution, is carried out over a user-specified time span for a set of user-specified inputs. Simulation proceeds in four major stages: compilation, link, code generation, and the simulation loop. Alternatively, the execution engine can obtain a linear representation of the model (linearization). The interrelationship between the various stages is illustrated in a flowchart in FIG. 4.

The execution begins when the block diagram 40 is compiled 42. Following the compilation stage, is the model link stage 44 which may also produce linear models 46. Code may or may not be generated 45. If code is generated 48, a decision is made 49 whether to continue the simulation. If the decision is made to continue the simulation the model is simulated/executed through the Simulation Loop 50. If the simulation is not continued, the code may be delivered to a target 52 and executed in an external mode 54. If code is not generated the block diagram may execute in interpretive mode when entering the Simulation Loop 50.

The compile stage marks the start of model execution and involves preparing data structures and evaluating parameters, configuring and propagating block characteristics, determining block connectivity, and performing block reduction and block insertion. The preparation of data structures and the evaluation of parameters creates and initializes basic data-structures needed in the compile stage. For each of the blocks, a method forces the block to evaluate all of its parameters. This method is called for all blocks in the block diagram. If there are any unresolved parameters, execution errors are thrown at this point.

During the configuration and propagation of block and port/signal characteristics, the compiled attributes (such as dimensions, datatypes, complexity, or sample time) of each block (and/or ports) are setup on the basis of the corresponding functional attributes and the attributes of blocks (and/or ports) that are connected to the given block through lines. The attribute setup is performed through a process during which block functional attributes “ripple through” the block diagram from one block to the next following signal connectivity. This process (referred to herein as “propagation”), serves two purposes. In the case of a block that has explicitly specified its block (or its ports') functional attributes, propagation helps ensure that the attributes of this block are compatible with the attributes of the blocks connected to it. If not, an error is issued. For instance, if an Integrator block is implemented to only accept numbers of double precision datatype, then this block will error out if it is driven by a block that produces single precision data, unless the user has asked for an implicit data conversion. Secondly, in many cases blocks are implemented to be compatible with a wide range of attributes. Such blocks adapt their behavior in accordance with the attributes of the blocks connected to them. This is akin to the concept of polymorphism in object-oriented programming languages. For instance, a discrete-time Filter block could be implemented to accept any of the standard integer datatypes ranging from 8-bit to 128-bit. The exact implementation of the block is chosen on the basis of the specific block diagram in which this block finds itself. Included within this step are other aspects such as validating that all rate-transitions within the model yield deterministic results and that the appropriate rate transition blocks are being used.

The compilation step also determines actual block connectivity. Virtual blocks play no semantic role in the execution of a block diagram. In this step, the virtual blocks in the block diagram are optimized away (removed) and the remaining non-virtual blocks are reconnected to each other appropriately. This compiled version of the block diagram with actual block connections is used from this point forward in the execution process

Once actual block connectivity has been determined (by removing the virtual blocks) the block diagram may be further optimized by performing block reduction and insertion. During this step, non-virtual blocks may be inserted or a set of non-virtual blocks may be completely removed or reduced to a single equivalent block. Block insertion and reduction is mainly done to improve execution efficiency. Examples of block insertion and reduction include the removal of Gain blocks whose gain value is 1.

A Gain block is a block that multiplies its input value by a gain parameter, such as a simple amplifier. FIG. 5 depicts the replacement of a collection of blocks 60, 62, and 64 connected in an accumulator pattern and leading to result 66 with an equivalent synthesized block 68 representing the accumulator pattern leading to the same result 66. A signal copy block may also be automatically inserted in order to make contiguous memory copies of signals that are made up of disjoint memory sections. Block insertion and reduction may also be performed at other suitable stages of compilation.

The way in which blocks are interconnected in the block diagram does not necessarily define the order in which the equations (methods) corresponding to the individual blocks will be solved (executed). The actual order is partially determined during the sorting step in compilation. Once the compilation step has completed, the sorted order cannot be changed for the entire duration of the block diagram's execution.

The first step in sorting involves transforming the graphical block diagram into a compiled (in-memory) directed graph consisting of arcs and vertices. The vertices are derived from some of the non-virtual blocks. For instance, virtual and reduced blocks do not appear in the directed graph. The arcs represent data dependencies between the vertices. The data dependencies do not correspond to the signals in the block diagram. For example, all signals that connect to input ports without direct feed through are “cut” or ignored. In addition, data dependencies are added to capture implicit dependencies. For example, all inputs to a Function-Call sub-system are implicit data dependencies to the owner (caller) block.

The process of converting a block diagram into a compiled directed graph is shown in FIG. 6A. A block diagram 81 includes a Sine Wave 1 block 82, a Sine Wave 2 block 84, a Goto block 86, a Function Call Generator block 88, and a From block 90. Also included are a Function Call Sub-system block 92, a Sum block 94, a Gain block 96, an Integrator block 98 and an Outport (Output 1) block 100. Those blocks that are not virtual or reduced appear on the corresponding directed graph 111. The directed graph 111 includes a Sine Wave1 vertice 112, a Sine Wave 2 vertice 114, a function-call generator vertice 116, and a function call sub-system vertice 118. Also included are a Sum vertice 120, a Gain vertice 122, an Integrator vertice 124 and an Outport 1 vertice 126. The vertices are connected by arcs.

The graph is used to sort the blocks into a linear sorted list. FIG. 6B depicts a sorted list 128 generated from the compiled directed graph 111 which includes the elements appearing as vertices in the directed graph 111 sorted into order. The root block diagram has a sorted-list associated with it. Roughly speaking, each non-virtual sub-system layer and some special block diagram elements also each have their own sorted-list. During the sorting of the graph into the list, strongly connected components are identified. The term strongly connected section, which is a term that originates from graph theory, is a subset, S, of the blocks of a block diagram such that any block in S is reachable from any other block in S by following signal connections and S is not a subset of any larger such set. Strongly connected sections are flagged as algebraic loops when all blocks have direct feedthrough (an example is shown in FIG. 6A consisting of the Sum 120 and Gain 122 blocks). Such loops correspond to a set of algebraic equations and are solved using iterations and perturbations during block diagram execution by solving for the algebraic variables. Algebraic variables are either specified by the user via Initial Condition blocks or chosen by the execution engine. Solving of algebraic loops is discussed further below.

Sorting must also take into consideration other user specified dependencies between the blocks. These dependencies include the concepts of priorities and placement groups. A block priority specifies the order in which the equations associated with a block are evaluated with respect to other blocks. Placement groups are a way of causing each class of block methods for a specified set of blocks to be “placed together” in the block method execution lists. The terms “data dependency” or “data precedence” as used herein refers to the arcs of the compiled directed graph and not the signals found within a block diagram. Attempting to correlate data dependencies directly to the signals found within a block diagram is incorrect and leads to the conclusion that Simulink® does not satisfy data dependencies, i.e., the execution of the operations or block methods does not satisfy data dependencies if one interprets signal connectivity as specifying data dependencies.

After compilation, the link stage commences. During this stage physical memory allocations are made in order to prepare for execution. Buffers are allocated for block input and output data buffers, states, and work areas. Additionally, block method execution lists that are derived from the sorted list allow for execution of the block diagram. Each block method execution list is a list of block methods that are to be executed in a sequence when each method within the list has a sample hit. There is generally a set of block method execution lists associated with each layer of the block diagram that corresponds to a non-virtual sub-system. Non-virtual sub-systems are either defined by the user or automatically synthesized during compilation to either efficiently execute the model or simplify the implementation of the semantics defined by Simulink®. In multi-tasking mode, the lists within each layer may be further partitioned when block diagrams have blocks with different sample rates. These lists are explained in greater detail below.

Those skilled in the art will recognize that while the block method execution lists are derived from the sorted list, they do not necessarily correspond one-to-one with the sorted lists. First, each block method execution lists contains only blocks that have such a block method of the given type (class) defined by the list. Second, block methods corresponding to components like the function-call sub-system do not appear on the block method execution lists because they are executed by an “owner” block.

Although included in the discussion of the compilation stage, it is not required that the time-based diagram perform the block sorting step during compilation. The sorting step is performed to achieve efficient execution. Ignoring efficiency, there is no semantic reason to perform the sorting step. Any random ordering of the block methods will work. In fact, any ordering of all block method execution lists except the Output block method execution list will result in the same level of efficiency. Randomly re-ordering the Output block method execution list will yield correct answers. If the Output block method list is randomly ordered, then the Simulation engine, when executing the Output block method execution list, continues sequencing through the Output block method execution list at each point in time until there are no changes.

Similarly included within the linking stage for the sake of simplicity, is the memory initialization of the model. The memory initialization of the model includes invoking block start, initialize, constant initialize, enable, and constant output methods. These are examples of some of the block methods that are used during model setup (prior to execution) to initialize the “state” of the system so that execution or linearization can commence.

The compiled and linked version of the block diagram may be directly utilized to execute the model over the desired time-span. This interpretive mode of execution is suitable for getting fine-grained signal traceability. It should be noted that the traceability associated with interpretive execution comes at the price of increased overhead in the form of additional execution-related data-structures and messaging in the engine. An alternative to the interpretive execution mode is to utilize the generated-code created by Real-Time Workshop tool for Simulink® models. In this mode, the engine (upon the behest of the user) translates a selected portion of the block diagram (or the entire block diagram itself) into code. Such code could be in a number of possible forms. The code may be instructions in a high-level software language such as C, C++, Ada, etc., hardware descriptions of the block diagram portions in a language such as HDL, or custom code formats suitable for interpretation in some third-party software. Alternatively, the code may be instructions suitable for a hardware platform such as a microprocessor, microcontroller, or digital signal processor, etc., a platform independent assembly that can be re-targeted to other environments, or just-in-time code (instructions) that corresponds to sections of the block diagram for accelerated performance.

The execution of a portion of the block diagram represented in code may be performed in a number of different ways based on the specific code format. The portion of the block diagram may execute a compiled version of the code generated in a high-level language (accelerated or software-in-the-loop simulation), the execution may simulate code that corresponds to a hardware description on a hardware simulator, (co-simulation execution), the execution may involve calling out to third-party software to run code generated for such software (co-simulation execution), or the execution may call out directly to hardware that will run code that was generated and compiled for that hardware (processor-in-the-loop execution).

There are several different advantages to execution through code generation. Execution of generated code can be more efficient than interpretive execution because of fewer data-structures and lesser internal messaging in the engine, although the increased efficiency generally comes at the cost of decreased execution traceability. Simulation of hardware descriptions during execution can help identify and resolve bugs in the software stage of a design project. Such bugs prove much more expensive to track and fix once the system has been implemented in hardware. Additionally, block diagram modeling software can be integrated with other software environments that are suitable for modeling and simulating special classes of systems. Models can be tested directly in hardware thereby making prototyping of new systems fast and cost-effective. For instance, consider the design of a controller for an anti-lock braking system of a car. The dynamics of the braking system can be executed in the interpretive mode in the block diagram. The controller itself can be implemented on a hardware micro-controller to test the efficiency of the control laws implemented within. Note that for such target execution, it is normally necessary for the time span over which a model is executed by the software to match real-world time. In other words, the software must allow real-time execution of the block diagram model. Those skilled in the art will recognize that when users generate code, they may choose to not proceed further with the block diagram's execution. They may choose to take the code and deploy it outside of the confines of the modeling software environment. This is normally the last step in the design of dynamic systems in a block diagram software package.

There are several forms of target code execution known to those skilled in the art such as Rapid Prototyping, Embedded System Deployment, and Hardware-in-the-Loop which execute a model or portions of a model via the generated code on a Real-Time System target. One aspect of deploying (executing) the generated code on a target is the notion of “external mode.” External mode refers to a system where Simulink® acts as a monitor and debugger of the generated code running in real-time on a target. In External Mode, users can change parameters and view signals via standard Simulink® elements. Another important aspect of the code generation technology is that it is very extensible. Provided with the Simulink® product family is the Target Language Compiler (TLC). This technology enables the creation of “active scripts” that control how the generated code is produced for a block diagram. Using TLC, one can tailor the generated code to suit their specific needs.

The execution of the block diagram uses a Simulation Loop (SimLoop) for solving for the block diagram's outputs for a specified set of inputs over a specified span of time (“Time” in reference to the Simulation Loop means the time-line corresponding to the tracing of the dynamic system's outputs, not real-world time unless otherwise noted). The term “SimLoop” applies to real-time systems where each iteration is tied to a physical periodic clock or other timer source. During this process, the block methods (equations) corresponding to the individual blocks are executed by type following their sorted order when they have a sample hit. The term “block execution” is loosely used to mean executing all block methods associated with the given block for a given time step, generally starting with the output method. Strictly speaking, blocks do not execute; the engine executes (evaluates) the appropriate block methods at the appropriate time points.

SimLoop has two variants “single-tasking” and “multi-tasking” depending on sample times. In general, the sample time of a block is the interval of time between calls to the Output, Update, and/or Derivative methods for a given block. In computing this interval, repeated calls at the same time instant (not in real-world time but the time corresponding to the execution of the dynamic system) are counted as the same call. A block's sample rate may also be thought of as the interval between successive executions of the block methods. If there is no uniform or regular interval between calls, then the block is said have a continuous sample time. If a uniform time interval can be found, then the block is said to have a discrete sample time equal to that interval. Although blocks may be associated with more than one sample time in a sufficiently complex dynamic system the descriptions contained herein are confined to blocks with a single sample-time. Those skilled in the art will recognize that the descriptions may be extended to encompass blocks with multiple sample times.

FIG. 7A depicts an abstract example of a block diagram being executed. The diagram includes a plurality of blocks 140, 142, 144, 146, 148 and 150. The block ports that have direct feedthrough are explicitly marked (using the symbol “df”)152. Additionally, an abstract view of the execution methods instantiated by each block is shown in FIG. 7B. The blocks contain a number of different methods 160, 162, 164, 166 and 168. Execution methods includes the three basic execution methods discussed earlier: Output, Update, Derivative, as well as several other methods that aid in advanced block functions such as initialization, linearization and zero-crossing detection.(which are discussed below). The data-dependencies between the compiled vertices created during sorting are used to generate the Sorted List 170 shown in FIG. 7C.

A block diagram consisting of blocks that all have the same sample time is said to correspond to a single-rate system. A block diagram consisting of blocks that have more than one sample time corresponds to a multi-rate system. FIG. 8 depicts a multi-rate system, adding sample-time information to the block diagram of FIG. 7A. The plurality of blocks 140, 142, 144, 146, 148, and 150 each have an associated sample time. Since the sample times in the block diagram differ between blocks, the system is considered a multi-rate system. Block A 140, block E 148 and block F 150 each have a sample time of 0.1 seconds. Block B 142, block C 144 and block D 146 each have a sample time of 1.0 seconds.

The SimLoop is the heart of the execution engine. Each full pass through the loop is responsible for computing the outputs of the system at a particular time. At the end of each loop, the execution time corresponding to the next pass through the loop is computed. If this time exceeds the stop time specified by the user, the execution terminates. Within the loop, the sequence in which individual block equations are solved is determined by two pieces of information: the sample times of the blocks and the sorted order determined during the Compile stage. The amalgamation of these two pieces of information gives the execution lists for the block diagram. Those skilled in the art will recognize that the execution lists are created in the Link stage and are explained in the context of SimLoops for convenience. There are two distinct approaches for building execution lists and using them in the SimLoop. These approaches correspond to the Single-tasking and Multi-tasking SimLoops summarized in the discussion on FIG. 10 below.

Simulink® also has the ability to modify coefficients (parameters) of blocks that declare their parameters as tunable. An example of such a block is a Sine Wave block that implements the function: output (time)=amplitude*sin(frequency*time+phase)+bias, where time is the independent variable and the parameters are: amplitude, frequency, phase, bias. When these parameters are declared as tunable, Simulink® lets the user change these coefficients during simulation. Changing parameters is a drastic operation in that the definition of the model has changed (e.g. the sine block defines equations that describe the system). Thus, to enable the changing of parameters during the SimLoop®, Simulink® first queues parameter changes and then applies them on the next time step. Thus, the changing of parameters is not immediate. The delay in the changing of parameters is needed to ensure system stability. The application of the parameters at the start of the next time step is combined with the reset of the solver (Integrator) if needed.

For the purpose of exploring single-task loops and multi-task loops, FIG. 9 depicts the block diagrams of FIG. 7A and FIG. 8 where Method1 corresponds to the Output method 190 and Method2 corresponds to the Update method 192. All other methods are ignored in the explanation of the loops. Simpler loops which do not include blocks that have continuous sample times are used in the example since the explanation is simpler in the context of discrete sample times and it is straight-forward to extend to continuous sample times.

In a single-tasking SimLoop, there is essentially a single execution time-line. On this time-line, each block is executed when it has a sample hit. A sample hit is defined to be an execution time instant that is an integer multiple of the block's sample time. To aid in execution, execution lists are constructed for each method type. FIG. 10 depicts the sequence of steps followed by a single-tasking execution loop. Following initialization (step 200), a time parameter is checked to see if the current time is less than the stop time (step 201). If the time is not less than the stop time, the simulation ends (step 202). If the time is less than the stop time, the simulation continues and the root output method execution list is executed (step 204). Following execution of the output method list (step 204) the update method execution list is executed (step 206). Following the performance of an integrate step (208) (the Integrate step is described in more detail below in FIG. 14), the time parameter is incremented by the applicable step size (step 210).

Blocks are arranged in the single-tasking execution lists in the sorted order as shown in FIG. 11A. A sorted list 250 is used to generate an Output method execution list 252 and an Update method execution list 254. Referring back to the example in FIGS. 7 and 8, the engine sequentially steps through and execute each block in the block method execution list when the execution time divided by the sample time equals an integer number (1, 2, 3, 4, etc.). At time zero (T₀), all the blocks are executed. This involves executing the Output methods for blocks F, E, D, A, B, and C (in this order as dictated by the sorted list) and then executing the Update methods of blocks F, E, and D (again, in this order based on the sorted list). The execution time then is then incremented by step size, which in this case is assumed to be 0.1 seconds. Execution then commences once again at the top of the loop for T=0.1 (T_(0.1)). Blocks F and E have a sample time of 0.1 seconds and have a sample hit (^(0.1÷0.1=1), sample time is an integer multiple of the execution time), so the output block methods for Blocks F and E are executed. Block D, however, has a 1.0 second sample time and has no sample hit (0.1÷1.0=0.1, sample time is not an integer multiple of the execution time), so its output block method is not executed (essentially it is skipped). Block A, like Blocks F and E, has a 0.1 second sample time and so its output block method is executed. Blocks B and C, like Block D, have 1.0 second sample times and are skipped during this iteration of the simulation loop, which completes execution of the output block method execution list for T_(0.1).

The execution timing of the example block diagram in single task mode is shown in the first time-line of FIG. 11B. In this diagram, note that the execution-time is not synchronized with real-world time. Instead, execution time progresses as fast as it can in real-world time. The sorted list 259 is executed on the time-line 260. The methods in the list 262 are executed at the appropriate time step 264. Block diagram modeling software can also allow users to simulate real-world conditions by synchronizing execution time with real-world time. Such execution is illustrated in the second timing diagram of FIG. 11B. The methods 262 are implemented at a time-step 264 synchronized with real world time on the time line 270.

In multitask mode, the engine performs execution along multiple time-lines based upon the number of block sample times used in the mode as shown in the flowchart of FIG. 13. In the example of FIGS. 7 and 8, the model's blocks have a sample time of either 0.1 seconds or 1.0 second. This implies that the engine runs one set of blocks along a 0.1 second time line and another set of blocks along a 1.0 second time line. In order to run in multitask mode, the execution lists are first divided on the basis of methods (as in single-tasking mode) and then subdivided again based upon block sample times. This is illustrated in FIG. 12A. The sorted list 280 is used to generate an output method execution list 282 and update method execution list 288. The output method execution list 282 is split into two separate list execution lists 284 and 286 based on sample times. Similarly, the update method execution list 288 is divided into two update method execution lists 290 and 292 based on sample times.

The execution engine uses the divided execution lists to create multiple execution time lines. In the multitask mode the engine places a higher execution priority on the faster sample time blocks than the slower sample time blocks. This prioritization is carried out by assigning Task Identification Numbers (TIDs) to each execution list; the higher the priority, the lower the TID. For example, a TID of 0 executes at a higher priority than a TID of 1, and so forth. Furthermore, because, during execution in multitask mode, execution transitions between the faster and slower blocks, and vice-versa, the multitask mode requires rate transition blocks that allow the model to transition from blocks running at fast sample times, in our example 0.1 seconds, to slower samples times, e.g., 1.0 seconds. The rate transition blocks are required to correctly simulate how a multi-rate system would behave in a real-time environment. To provide this transition, the engine promotes rate transition blocks to the TID of the fast block for which transition is being provided, although the engine executes these rate transition blocks at their slower rate. This is why Blocks D and B appear in the 0.1 sample time output method execution list in FIG. 12A.

The execution of our example in the multi-task mode may be seen in FIG. 12B. At time T=0, the engine first executes the high priority output methods (those with TID 0) for Blocks F, E, D, A and B, then it executes the high priority update methods (those with TID 0) for Blocks F and E. After finishing the high priority blocks, the engine executes the lower priority output block methods (those with TID 1) for Block C, and then executes the lower priority update methods (those with TID 1), which, in this example, is Block D. In contrast to the single task mode, in multitask mode the engine runs through a TID inner loop to execute the output and update block methods before going on to the Integration step, as the flow chart in FIG. 13 which is discussed below illustrates.

As a result of the inner TID loop, as well as the segregated block method execution lists, the order of execution in multitask mode differs from the order of execution in single task mode. Recall for the example that in single task mode that the order of execution at T=0 is: F_(o), E_(o), D_(o), A_(o), B_(o), C_(o), F_(u), E_(u), and D_(u), where the subscript “o” stands for output method and the subscript “u” stands for update method. In the multitask mode, however, the order of execution at T=0 is: F_(o), E_(o), D_(o), A_(o), B_(o), F_(u), E_(u), C_(o), and D_(u). Notice that C_(o) is executed in a different order in multitasking mode. This occurs because separate method execution lists (based upon sample time) are created and run in order from fastest sample time to slowest sample time. Additionally, the use of rate transition blocks restricts the connection of blocks with different rates. By requiring the insertion of these blocks into the model, the engine ensures that execution in multitask mode will follow the sorted list.

After it is finished executing the block methods for T=0, like in the single task mode, the execution time is incremented (again assume by 0.1 seconds) and execution goes to the beginning of the loop. The engine executes F_(o), E_(o), A_(o), F_(u), and E_(u), and the engine does not execute the block methods of Blocks D, B, and C because the current execution time is not an integer multiple of those block's sample time. The engine repeats this execution until the execution time is incremented to 1.0 seconds, whereupon execution occurs in the same manner as described for T=0. The engine repeats this overall process until the execution stop time is reached.

FIG. 12B shows two time-lines; the lower time-line 306 represents the execution order of the faster sample time blocks (Blocks A, E, and F), along with the rate transition blocks (Blocks B and D), while the top time-line 308 shows the execution order of the slower sample time block (Block C), and the rate transition (Block D) update method. The time-lines are generated from the sorted list 302 and the associated sample times 304. The lower line, representing the faster sample times has a TID of 0, and the top line has a TID of 1. For execution time T=0, the chart shows that the engine executes the output methods for Blocks F, E, D, A, and B (designated on the chart as F_(o), E_(o), D_(o), A_(o), B_(o)). Then, consistent with the flow chart for the multi-tasking mode (see FIG. 13 discussed below), the engine executes the update block methods for Blocks F and E (designated F_(u), and E_(u)). Once the engine is finished with the high priority block methods, the output method for Block C (C_(o)) and the update method for rate transition block D (D_(u)) are executed. The execution time is then incremented by the step size (continue to assume 0.1 seconds) and the blocks that have a sample hit are executed. The figure shows execution of F_(o), E_(o), A_(o), F_(u), and E_(u), which is repeated, as noted above, until execution time equals 1.0 second. Notice, like in the non-real-time case for Single-task mode, the engine does not wait for time to elapse; rather it executes block methods immediately upon completion of the previous pass through the loop.

FIG. 13 shows the overall sequence of steps taken by Simulink® in multitask mode. Following initialization (step 220), the output method execution list is executed for the fastest sample time (step 222). The update method execution list is then executed for the fastest sample time (step 224). A time parameter is checked (step 225) to determine if the time is less than a designated stop time. If the stop time has been reached, the simulation completes (step 226). Otherwise, the integrate stage (step 228) is performed. The task ID variable is incremented (step 230) and compared to a parameter of the number of sample times (step 231). If the task ID is less than the number of sample times, the output method execution list for the methods assigned the new task Id are executed (step 232) followed by the execution of the update method execution list assigned the new task ID (step 234). The task ID variable is incremented and the process iterates with the task ID being compared to the number of sample rate times (step 231). When the task ID number is determined to equal the number of sample rate times, the simulation time is incremented (step 238) and the entire process iterates with the output method list execution list (step 222) being executed for the fastest sample times. The process continues until the end of simulation when the time equals the stop time (step 226).

In order to understand how the step size is picked within SimLoop, it is first necessary to understand the notion of a solver. The solver is a module of the execution engine that is responsible for performing two tasks: (a) determining how far execution time should be advanced between consecutive passes through the SimLoop in order to accurately trace the system's outputs, and (b) integrating the derivative of the states of the system to obtain the actual states. Based on how solvers perform the first task, they are generally classified into two basic classes: Fixed-step solvers or Variable-step solvers.

Fixed-step solvers are solvers in which the time step-size between consecutive passes through the SimLoop is a fixed quantity. The user generally explicitly specifies this quantity. These solvers are used to model types of systems that must operate within a defined time (discrete systems). For instance, an anti-lock braking system may be designed to control a car's braking system, and to execute such control in one-one hundredth (0.01) of a second so as to assure the car stops safely; if the braking system does not meet its timing constraints, the car may crash. Fixed-step solvers, therefore, are designed to help model discrete systems that have to generate a result in a fixed time period, and the fixed-step execution assures that the modeled system can generate such results.

Variable-step solvers are designed to model continuous systems where non-evenly spaced time steps are needed to simulate all significant behavior. For example, one may want to simulate the path of a bouncing ball, where it bounces, how high it bounces, and where it stops. It is known, based on experience, that the ball's bounces will not be evenly spaced, and that the height of the bounces will diminish as a result of gravity, friction, and other forces. Variable-step solvers are used for these types of continuous systems and to determine what step size to use so that the behavior of the ball will be accurately modeled.

The two broad classes of solvers are further subdivided based on the integration task they perform. There are several algorithms for carrying out numerical integration. The particular choice of the integration algorithm gives rise to the subclasses of solvers.

The difference in the conceptual definition of Fixed- and Variable-step solvers leads to the functional difference in the context of the SimLoop. The major difference between the solvers arises in the Integrate step of the SimLoop which is depicted in FIG. 14. During the Integrate step, the Variable-step solver executes the Output and Derivative block method lists for a number of iterations that varies based on the solver subclass (i.e., the numerical integration algorithm it uses) and integration error tolerances. In a fixed-step solver, the number of iterations is fixed for a given solver subclass. Another difference between solvers arises in the Integrate phase in the context of an operation known as zero-crossing detection. Zero-crossings in the derivatives of the state generally indicate a discontinuity in the states themselves. Because discontinuities often indicate a significant change in a dynamic system, it is important to trace the system outputs precisely at such points. Otherwise, the outputs of the model could lead to false conclusions about the behavior of the system under investigation. Consider, again the example of the bouncing ball. If the point at which the ball hits the floor occurs between simulation steps, the simulated ball appears to reverse position in midair. This might lead an investigator to false conclusions about the physics of the bouncing ball. To avoid such misleading conclusions, it is important that the execution has time steps on and around the vicinity of discontinuities.

In the case of Fixed-step solvers, there is no notion of zero-crossing detection and one is not guaranteed to find all points of discontinuity. One can only keep reducing the step-size to increase the probability of hitting the discontinuity. Contrastingly, in the case of Variable-step solvers, the Integrate step explicitly includes zero-crossing detection. The execution step size is then adjusted accordingly to ensure that discontinuities are tracked accurately. To enable zero-crossing detection, blocks that can produce discontinuities instantiate a special execution method. This method registers a set of zero-crossing variables with the execution engine, each of which is a function of a state variable that can have a discontinuity. The zero-crossing function passes through zero from a positive or negative value when the corresponding discontinuity occurs. During the zero-crossing detection phase of the Integration step, the engine asks each block that has registered zero-crossing variables to update the variables for the projected time of the next time step. These variables are then checked for a change of sign since the current step. Such a change indicates the presence of a discontinuity. An iterative process then tries to narrow down the location of the discontinuity and ensure that the next few time steps (at least 2) accurately bracket the location of the discontinuity. The final difference, which is in the step-size during execution, is a direct consequence of the two previous differences in the step-size determination. In Fixed-step solvers, the step size is a known and fixed quantity. For Variable-step solvers, the step size is determined during the integration iterations and the zero-crossing detection that happens during the Integration step.

An example of the variable-step solver is shown in FIG. 14, the derivative method execution list is executed (step 240) followed by the output method execution list (step 242). The derivative method execution list is then executed again (step 244) and the solver iterates between the execution of the output method execution list (step 242) and the execution of the derivative method execution list (step 244). A similar iteration loop then occurs between the execution of the output method execution list (step 246) and the execution of the zero-crossing method execution list (step 248). Note that Simulink® also includes other methods such as Projections and Jacobians in this step as needed.

While it is theoretically possible to have Variable-step solvers in the context of multitasking, such a combination is not employed in practice. This is because the step-size for such solvers can become very small making it impossible to keep up with the real-time constraint that generally goes along with multitasking execution. An added complication is that the integration step in such solvers is iterative and takes varying amounts of time at each step of the execution. Therefore, Variable-step solvers are generally used only in conjunction with the Single-Tasking SimLoop. Additionally, they are not usually employed in systems that need to operate in real-time.

When a model contains an algebraic loop, the engine calls a loop solving routine at each time step. The loop solver performs iterations and perturbations to determine the solution to the algebraic condition (if it can). One possible approach to solving the algebraic equation F(z)=0, is to use Newton's method with weak line search and rank-one updates to a Jacobian matrix of partial derivatives. Although the method is robust, it is possible to create loops for which the loop solver will not converge without a good initial guess for the algebraic states z. Special blocks are generally provided to specify an initial guess of the states in the algebraic loop.

In addition to the various forms of the SimLoop, modeling packages such as Simulink® use the output of the Link stage to compute linear models through a process generally referred to as model linearization. These linear models may be used in the SimLoop at various points in the execution of the overall model. Alternatively, the linear model may be returned to the user. The linearization process involves the use of a Jacobian method defined on blocks and numerical Jacobian algorithm.

Information related to the compiled block diagram may be presented to users in an automatically generated report. This report allows users to quickly obtain documentation of the functional description of their model. Information related to the execution of a particular model (such at the time taken to execute various portions of the model and the coverage of various portions of the model) may be obtained automatically and presented to the user as a report.

As previously mentioned above, a dynamic system can be simulated using a block diagram, and code can be automatically generated to represent the block diagram structure in a textual format, and ultimately to perform a model or simulation execution. Simulating a dynamic system in a graphical programming environment is typically a two-step process. First, a user creates a graphical model, such as a block diagram, of the system to be simulated. A graphical model may be created using a graphical user interface, such as a graphical model editor. The graphical model depicts time-based relationships between the systems inputs, states, parameters and outputs. After creation of the graphical model, the behavior of the dynamic system over a specified time period is simulated using the information entered into the graphical model. In this step, the graphical model is used to compute and trace the temporal evolution of the dynamic systems' outputs (“execute the graphical model”), and automatically produce either deployable software systems or descriptions of hardware systems that mimic the behavior of either the entire model or portions of the model (code generation).

Block diagrams are graphical entities having an “executable meaning” that are created within graphical programming environments for modeling a dynamic system, and generally comprise one or more graphical objects. For example and as previously discussed, in Simulink®, a model of a dynamic system is a block diagram comprising a number of graphical objects. Generally, a block diagram comprises a plurality of nodes, called blocks, which are interconnected by lines that represent signals. In Simulink®, each block represents a functional entity, such as an elementary dynamic system, which implements a mathematical operation, i.e., an algorithm or equation, on the data being processed by the system represented by the block diagram. Each block produces an output either continuously (a continuous block) or at specific points in time (a discrete block).

Other examples of block diagrams include state chart diagrams such as those found within Stateflow, also available from The MathWorks, Inc, data flow diagrams, and so on. Many graphical programming systems employing block diagrams are hierarchical. A hierarchical diagram consists of ‘layers’ where a layer is a diagram in itself and is represent in the ‘parent’ layer as a single block. Connections to the block are routed into the lower layer.

Thus, there is a variety of different model representations for modeling a dynamic, or other, system, including all of the above-mentioned text-based and graphically-based modeling techniques, in addition to other modeling environments, such as Unified Modeling Language (UML). UML can be characterized as a general-purpose notational language for specifying and visualizing complex software. The language is particularly efficient at handling larger, object-oriented, programs. UML is a more recent modeling language that builds on previous notational methods, such as Booch, OMT, and DOSE. Other modeling languages can also fall into the classification of model representations.

In the field of simulation programs using model representations, including graphical block modeling applications and text-based modeling applications, there are instances of automated code generators. Automated code generators, in the context of these simulation programs, generally provide automated functionality for the creation of code or functions based on a selected configuration with defined parameters. The more common application of automated code generators is the automated conversion of a block diagram model to a text-based software algorithm. When automated code generators transform hierarchical block diagrams into executable functions, the hierarchy of the model maps to the functional call graph of the generated code. Users of automated code generators often desire control of the function signatures of the functions produced by the code generators.

A function signature, as utilized herein, refers to, e.g., data types, domains, and order of inputs and outputs for a function. More generally, a function signature is a collection of information or parameters that characterize how a particular function is invoked, or how a function produces a result. In an auto-coding process, a function signature can be modified to provide some definition as to how automatically generated functions should be structured.

In some instances, necessary arguments to the functions that are automatically generated are generally not immediately obvious to a user. Typically, many arguments are artifacts resulting from implementing an object oriented design specification, such as functional units with internal states, with a procedural language such as C or Ada. For example, many arguments do not map directly to the input and output ports of the system or model to which the function corresponds; therefore some of these types of arguments may not be visible to the user. In addition, it can be cumbersome to maintain a literal specification of the function signatures as elements of a model are added or deleted, which changes the exact number and types of function arguments.

SUMMARY OF THE INVENTION

There is a need for a system and method enabling a user to specify function signatures for automated code generators and optionally preview the resulting functions, if desired, using a user interface. The present invention is directed toward further solutions to address this need.

In accordance with one embodiment of the present invention, in an electronic device, a method for automatically generating a function based on a model representation includes providing at least a portion of the model representation. A function signature for the model representation is received. The function signature is generated by a user. The function is generated based, at least in part, on the model representation and the function signature.

In accordance with aspects of the present invention, the function signature includes at least one of a number of arguments, an order of arguments, a type of argument return, and a name for the function. The model representation includes at least one of a graphical model representation and a textual model representation. The function signature can indicate parameters causing the function generated to operate in conjunction with selected legacy code. A plurality of arguments can be grouped within the function signature.

In accordance with further aspects of the present invention, a user interface is provided that presents preview of the function generated by the electronic device at least partially based on the function signature and the model representation. A user can refine the function signature by reviewing the preview and manipulating the function signature. The preview can be displayed substantially contemporaneous with the user entering the function signature.

In accordance with another aspect of the present invention, the function signature is at least partially comprised of regular expressions.

In accordance with another embodiment of the present invention, in an electronic device, a system for automatically generating a function based on a model representation is provided. The system includes a mechanism providing at least a portion of the model representation. A user interface enables a user to specify a function signature. An automated code generator is provided for generating the function based on the model representation and the function signature.

In accordance with another embodiment of the present invention, a computer-readable medium holding computer readable instructions for performing executable steps for carrying out a method of automatically generating a function based on a model representation is provided. The method includes the step of providing at least a portion of the model representation. A function signature for the model representation is received, wherein the function signature is generated by a user. The function is generated based on the model representation and the function signature.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will become better understood with reference to the following description and accompanying drawings, wherein:

FIG. 1A depicts a conventional dynamic system described with ordinary differential equations (ODE);

FIG. 1B depicts a conventional dynamic system described with difference equations;

FIG. 1C depicts a conventional dynamic system described with algebraic equations;

FIG. 2 depicts conventional components of a basic block diagram;

FIG. 3 depicts the desired behavior of a conventional integrator block;

FIG. 4 is a flow chart of the sequence of steps used to perform conventional simulation of the block diagram;

FIG. 5 depicts the conventional replacement of a collection of blocks in a block diagram with an accumulator block;

FIG. 6A depicts a conventional block diagram and its associated directed graph;

FIG. 6B depicts a conventional linear sorted list generated from the directed graph of FIG. 6A;

FIG. 7A depicts an abstract example of a conventional block diagram being executed;

FIG. 7B depicts an abstract view of the conventional execution methods instantiated by the blocks depicted in FIG. 7A;

FIG. 7C depicts a conventional sorted list generated from the data dependencies between blocks of FIG. 7A;

FIG. 8 depicts a conventional multi-rate system;

FIG. 9 depicts the block diagram of FIG. 7A and FIG. 8 with associated conventional methods added to the blocks;

FIG. 10 is a flowchart of the conventional sequence of steps followed by a single-tasking execution loop;

FIG. 11A depicts the conventional creation of execution lists from sorted lists in single task mode;

FIG. 11B depicts the conventional execution timing of block diagrams in single task mode in timelines synchronized and non-synchronized with real world time;

FIG. 12A depicts the conventional creation of execution lists from sorted lists in multi-task mode;

FIG. 12B depicts the conventional execution timing of block diagrams in multi-task mode;

FIG. 13 is a flowchart of the conventional overall sequence of steps taken by Simulink® in multi-task mode;

FIG. 14 is a flowchart of the conventional sequence of steps followed by a variable-step solver;

FIG. 15 is a diagrammatic illustration of an electronic device for executing the method according to one aspect of the present invention;

FIG. 16 is a diagrammatic illustration of a graphical representation of a model, in accordance with one aspect of the present invention;

FIG. 17 is a representative screen view of a user interface for practicing the method of the present invention;

FIG. 18 is a flowchart illustrating a function signature specification method, in accordance with one aspect of the present invention;

FIG. 19 is a diagrammatic illustration of a graphical representation of a model, in accordance with one aspect of the present invention; and

FIG. 20 is a representative screen view of a user interface for practicing the method of the present invention.

DETAILED DESCRIPTION

An illustrative embodiment of the present invention relates to a system and method for specifying function signatures for automated code generators transforming hierarchical models, whether in graphical or textual format, into executable functions. For purposes of clarity of illustration, the following description is directed toward utilizing an automated code generator to general executable functions based on hierarchical block diagrams, or other graphically based models or simulations. The example illustrations are based on the Simulink® modeling application provided by The Mathworks, Inc. of Natick, Mass. The present invention, however, is not limited to use with Simulink®, or with graphical modeling programs in general. Instead, the present invention has utility in the automated code generation process of a number of different model formats, including graphical, text-based models, and other forms of model representations, and associated languages.

The illustrative examples also include use of a graphical user interface (GUI) for implementing the system and method of the present invention. The GUI identifies a subsystem or model for which a user can specify a function signature. The specification of the function signature can be executed using regular expressions, which permit parts or the entire user interface to be specified as broadly or narrowly as desired. The GUI further provides a real time code preview of the literal function signature that results given the specified function signature. A user, however, is not required to make use of regular expressions when defining a function signature.

As referred to previously, and as utilized herein below, a function signature refers to, e.g., data types, domains, and order of inputs and outputs for a function. More generally, a function signature is a collection of information or parameters that characterize how a particular function is invoked, or how a function produces a result. In an automated coding process, a function signature can be modified to provide some definition as to how automatically generated functions should be structured.

For purposes of the following description, the phrase “regular expression” should be interpreted in accordance with convention. More specifically, a regular expression can be characterized as an algorithm for matching strings that follow some pattern. Regular expressions are often in the form of metacharacters, but can also be unique combinations of normal characters. Metacharacters include, but are not limited to, symbols on a standard keyboard, such as “*”, “$”, “^”, “.”, or “\”. The metacharacter “*” is generally known to be a wildcard. The metacharacter “$” typically refers to a match for the end of a line of code. The metacharacter “^” typically refers to a match for the beginning of a line of code. The metacharacter “.” typically refers to a match for any one character. The metacharacter “\” typically refers to a quotation of a following character. The above metacharacter definitions may change depending on the particular programming language. The purpose of the metacharacter is to provide a simple symbol that represents a pre-defined action within the code. The normal characters can combine, as well, to form actual words or made-up words, but with a pre-defined action.

The regular expressions are very useful to programmers when authoring new programs or code. Usage of regular expressions can make the coding process more efficient because the tasks performed by the regular expressions do not have to be re-created at a code level to carry out the desired tasks.

Automatically generated code can be generated by a number of different applications. One example code-generating tool is the Real-Time Workshop, which works in conjunction with Simulink® models. The code-generating tool (typically upon instruction by the user) translates a selected portion of the block diagram (or the entire block diagram itself) into code. Such code could be in a number of possible forms. The code may be instructions in a high-level software language such as C, C++, Ada, and the like, hardware descriptions of the block diagram portions in a language such as HDL, or custom code formats suitable for interpretation in some third-party software. Alternatively, the code may be instructions suitable for a hardware platform such as a microprocessor, microcontroller, or digital signal processor, etc., a platform independent assembly that can be re-targeted to other environments, or just-in-time code (instructions) that corresponds to sections of the block diagram for accelerated performance. Such automated code generators are known in the art, and understood by one of ordinary skill in the art.

FIGS. 15 through 20, wherein like parts are designated by like reference numerals throughout, illustrate an example embodiment of a system and method for specifying function signatures for automated code generation in accordance with the present invention. Although the present invention will be described with reference to the example embodiments illustrated in the figures, it should be understood that many alternative forms can embody the present invention. One of ordinary skill in the art will additionally appreciate different ways to alter the parameters of the embodiments disclosed in a manner still in keeping with the spirit and scope of the present invention.

FIG. 15 illustrates one example embodiment of an electronic device 500 suitable for practicing the illustrative embodiments of the present invention. The electronic device 500 is representative of a number of different technologies, such as personal computers (PCs), laptop computers, workstations, personal digital assistants (PDAs), Internet appliances, cellular telephones, and the like. In the illustrated embodiment, the electronic device 500 includes a central processing unit (CPU) 502 and a display device 504. The display device 504 enables the electronic device 500 to communicate directly with a user through a visual display. The electronic device 500 further includes a keyboard 506 and a mouse 508. Other potential input devices not depicted include a stylus, trackball, joystick, touch pad, touch screen, and the like. The electronic device 500 includes primary storage 510 and secondary storage 512 for storing data and instructions. The storage devices 510 and 512 can include such technologies as a floppy drive, hard drive, tape drive, optical drive, read only memory (ROM), random access memory (RAM), and the like. Applications such as browsers, JAVA virtual machines, and other utilities and applications can be resident on one or both of the storage devices 510 and 512. The electronic device 500 can also include a network interface 514 for communicating with one or more electronic devices external to the electronic device 500 depicted. A modem is one form of network interface 514 used for establishing a connection with an external electronic device or network. The CPU 502 has either internally, or externally, attached thereto one or more of the aforementioned components. In addition to applications previously mentioned, modeling applications and automated code generation application, such as Simulink® 516 and Real Time Workshop® 518, respectively, can be installed and operated on the electronic device 500.

It should be noted that the electronic device 500 is merely representative of a structure for implementing the present invention. One of ordinary skill in the art will understand that the present invention is not limited to implementation on only the described device 500. Other implementations can be utilized, including an implementation based partially or entirely in embedded code, where no user inputs or display devices are necessary. Rather, a processor can communicate directly with another processor, or other device.

FIG. 16 is a screen depiction of a graphical user interface (GUI) 610 displaying an example graphical model 612. The graphical model 612 depicts a dynamic system having a first input 614 (In1) and a second input 616 (In2), each input being of type integer in this example. The first input 614 and second input 616 feed to a Sum 618 function. The Sum 618 function adds the two input values together and calculates an output 620 (Out). The GUI 610 further includes a display of a function signature 622, which is a text-based formula system interface specification that defines how a function representing the graphical model 612 should be produced. It should be noted that the graphical model 612 and function signature 622 shown are merely representative examples of a model and function signature respectively. The present invention is not limited to the example illustration.

In combination with the graphical model 612, a function signature can be specified by the user. The function signature places various input and output restrictions on the automatically generated function or functions representing the graphical model 612. In the present example, the user has entered the following function signature 622, using regular expressions:

-   -   01=foo(&i2,i1)

For the example graphical model 612, and function signature 622 above, the following function will result. Again, this is an example illustration. The present invention is not limited to the specific function that results. The resulting function that represents the graphical model in the format defined by the function signature specification is:

-   -   int32_T foo(int32_T *In2, int32_T In1) {     -   return (In1+(*In2));     -   }

When generating code, Real Time Workshop creates functions corresponding to the units or components of the model, such as subsystems in the model, and even the model itself. By necessity, the function has arguments corresponding to data passed to and from, or maintained by, the unit, e.g. the unit's I/O, the states of the unit, parameters of the unit, as well as various other auxiliary variables such as zero-crossing signals and continuous state derivatives.

Some attributes of the function and its arguments, such as datatype, complexity, and dimension, are provided or implied by the model representation, and may not be modified without invalidating the semantics of the model and the corresponding implemented application. Other attributes, such as the order of the arguments, the argument passing mechanism (e.g. by value vs. by reference), and the name of the function may be arbitrarily computed or specified during the process of automatic code generation, without impacting the semantics of the generated application. In the absence of any user specification, this latter set of attributes is automatically computed based on rules that attempt to enhance readability of the code. Readability, however, is a subjective characteristic and it is possible that the rules implemented may not lead to code that any given user feels is optimally readable.

Therefore, in accordance with the present invention, the function signature parameters are provided so the user can gain control over the second set of attributes named above (e.g., the order of the arguments, the argument passing mechanism such as by value vs. by reference, and the name of the function) and optimize the readability and ability to integrate the code according to the user's personal subjective and objective criteria. If regular expressions are liberally employed, so that the function signature is loosely constrained, the automatic code generator continues to apply many rules to attempt to maximize the readability of the code, conforming to the constraints implied to the extent that they exist. The success of the strategies employed will be to a degree a subjective opinion. If regular expressions are scarcely employed, or not used at all, the automatic code generator generates code that more literally conforms to that which the user has specified.

As mentioned, the function signature 622 includes some regular expression language. In order to understand the regular expressions, a standard syntax is required for a particular software application or operating system. The standard syntax is stored, for example, in a syntax library 507 located, in one embodiment of the invention, in the primary storage 510 (shown in FIG. 15). The syntax rules essentially define the actions of the metacharacter and normal character regular expressions. The syntax rules for interpreting the function are provided in accordance with one example illustrative embodiment of the present invention, and are as follows:

An “*” packages all data for a model into a single argument (a structure passed by reference). For this case, the function return type is void.

Pure capital letters (i.e., no numbers) specify that arguments are passed by structure reference. The legal set is {I, O, P} for inputs, outputs, and parameters, respectively. For example, “I” specifies that all input ports are packed into a single inputs structure.

Lowercase alphanumeric letters specify individual arguments in a specified order. The legal set is {i<n>, o<n>} for input, and outputs, respectively. For example, “i1” specifies that input port 1 are passed as an individual argument. Parameters can also be referred to using named indexing, such as “p(<name>)”.

Pure lowercase letters followed by “*” specify individual arguments in an unspecified (deterministic) order. The legal set is {i*, o*, p*} for inputs, outputs, and parameters, respectively. For example, i* is equivalent to i1, i2, i3, and the like.

Lowercase alphanumeric letter combinations followed by “*” are used to expand bus signals. The legal set is {i<n>*, o<n>*}for inputs and outputs, respectively. For example, i3* expands the bus signal driving input 3 as individual arguments to the function (only the elements accessed by the system).

By default, individual scalar input and parameter arguments are passed by value. To pass them by reference, an “&” qualifier is used. All other arguments, e.g. vectors and outputs, are always passed by reference (in which case an & is allowed, but redundant).

Unspecified and auxiliary data (dwork, states, modes, etc.) for the system is left for an application such as Real Time Workshop® (provided by The Mathworks, Inc. of Natick, Mass.) to optimize, as desired, and does not appear in the argument list for single-instance code. Unspecified and auxiliary data is appended to the argument list for multi-instance code. Real Time Workshop® generates optimized, portable, and customizable ANSI C code from Simulink® models.

Argument names are pulled from the appropriate location in the model, as possible. For example, the block name of the first import is used in the generated code for the “i1” argument.

As previously discussed, a particular metacharacter or combination of normal characters can have a different action depending on the particular environment in which the metacharacter or normal characters exist. Thus, in accordance with one embodiment of the present invention, the above guidelines, or syntax, provide a structure for the automated preparation of functions based on a user defined function signature. It should be noted, however, that the present invention is not limited to the actual correlation between regular expression and resulting action as described. In other words, for the example embodiment, the “*” symbol has been defined as packaging all data for a model into a single argument. The “*” could be defined to execute a different action. The syntax, once developed for a particular coding language, should remain the same so that programs written in that language do not have to be re-written to reflect changes in regular expression actions. Thus, the regular expression definition typically does not vary after a coding language has been developed for a particular application (such as Simulink®).

The function signature 622 can be entered in a preview graphical user interface (preview GUI) 630 provided in accordance with the present invention. FIG. 17 shows the preview GUI 630. The preview GUI 630 includes a first column 632 into which a user can enter a function signature 634 using regular expressions. The preview GUI 630 further includes a second column 636, which displays a resulting function 638 based on input from a graphical model (such as the graphical model 612 of FIG. 16). The preview GUI 630 is not limited to the particular layout or design illustrated. The preview GUI 630 has functional characteristics including a location for a user to enter a function signature, and a location for a code preview of the functions that would result from the entered function signature. Such displays, as understood by one of ordinary skill in the art, can be embodied in a number of different ways, and the present invention preview GUI 630 anticipates such different approaches having the same or similar functionality.

In accordance with the present invention, the user can refine functions automatically generated to represent the graphical model 612 using the preview GUI 630. The refining process can be used to create functions that properly mesh with legacy code or library code, for example. In addition, the efficiency of the functions automatically generated can be improved through iterative analysis and refinement. FIG. 18 is a flowchart illustrating one example process for the automated generation and subsequent user refinement of functions representing the graphical model 612.

First, a dynamic system is modeled and provided (step 400) in the form of the graphical model 612. Again, the particular graphical model 612 illustrated in FIG. 15 is merely exemplary. The preview GUI 630 is initiated (step 402). The user then enters a function signature 622 defining parameters to be followed by the software application when automatically generating the functions to represent the graphical model 612 (step 404). As the user specifies the function signature 622, the preview GUI 630 dynamically displays the function or functions that result from the automated code generation process (step 406). It should be noted that the preview functions that are displayed by the preview GUI 630 are provided in real time as changes or entries are made to the function signature. Thus, the present invention provides a dynamic environment in which users can quickly and efficiently propose function signatures and see the effect the functions signatures have on the resulting function(s) of the automated code generator.

The preview technology in the preview GUI 630 does not rely on generating code for the entire model and then showing only an excerpt corresponding to the unit for which the signature is provided. This approach would be intractable for large models, for which code generation time can be excessive, and not real-time. Instead, the preview GUI 630 offers a representation of the code that will be generated for the unit of interest, and generates that representation considering only the unit of interest rather than the entire model.

The process used to deliver the preview is different from the code generation process employed when generating code for the model in that the process used to deliver the preview can operate with a set of information that is partial with respect to the information available when generating code for the model. As a result, the preview can employ tokens or regular expressions in place of literal identifiers and expressions. The process used to deliver the preview will employ tokens or regular expressions only to the extent necessary and the preview is at least as literal as the specification used to define the function.

The user can review the resulting function(s) for desired characteristics and decide whether to return to, and modify, the function signature 622 to change the resulting functions(s) (step 408), thus repeating the process and refining the resulting functions. The refinement process can recur as often as desired by the user to arrive at a desired resulting function. Once the user is satisfied with the previewed resulting functions, the user can finalize the function signature and execute the automated code generation (step 410).

As understood by one of ordinary skill in the art, the function signature can include different parameters, such as a number of arguments, an order of arguments, a type of argument return, a name for the resulting function(s), and other function characteristics. The function signature can provide parameters that require the resulting function(s) to correspond to selected legacy code, which is code that has been previously provided by a source separate or external to the immediate model or subsystem being modeled, and thus dictates its own function signature requirements to the user. In other words, legacy code might have specific requirements, such as any of the above parameters, for handling input values and output values of the legacy code. The user has complete control, using the system and method of the present invention, over the automatically generated code to ensure that the resulting functions will mesh properly with the legacy code.

In accordance with the example embodiment, the user is not limited to having a single argument within the function signature 622. Instead, the user can enter a number of different arguments, representing a number of different parameters for the automated generation of the resulting function(s).

Another example implementation of the present invention relates to the automatic code generation representing a graphical subsystem as shown in FIGS. 19 and 20. FIG. 19 is a screen depiction of the graphical user interface (GUI) 10 displaying an example graphical model 650. The graphical model 650 depicts a dynamic system having a first input 654 (In1), a second input 656 (In2), and a third input 658 (In3), each input being of type integer in this example. The first input 654, second input 656, and third input 658 feed to a Switch 660 function. The Switch 660 function switches between the first input 654 and the second input 656, and leads to an output 662 (Out). Again, the graphical model 650 shown is merely representative of a model. The present invention is not limited to the example illustration.

In combination with the graphical model 650, a function signature can be specified by the user. In the present example, the user has entered the following function signature, using regular expressions:

-   -   bar(o1, &i1*, i2, p{threshold}, i3)

For the example graphical model 650, and function signature above, the following function will result. Again, this is an example illustration. The present invention is not limited to the specific function that results. The resulting function that represents the graphical model in the format defined by the function signature specification is:

void bar(BUS_T *Out1_1, int32_T *Out1_2, int32_T *In1_1, int32_T *In1_2, BUS_T *In2, int32_T threshold, int32_T In3) {

-   -   if (In3 >threshold) {         -   Out1->a=*In1_1;         -   Out1->b=*In1_2;     -   } else {         -   Out1->a=In2.a;         -   Out1->b=In2.b;     -   }

}

The function signature can be entered in a preview graphical user interface (preview GUI) 630 provided in accordance with the present invention. FIG. 20 shows the preview GUI 630. The preview GUI 630, having the first column 632 into which a user can enter a function signature 670 using regular expressions. The preview GUI 630 further includes the second column 636, which displays a resulting function 672 based on input from a graphical model (such as the graphical model 650 of FIG. 19). The preview GUI 630 is not limited to the particular layout or design illustrated. as understood by one of ordinary skill in the art.

Thus, the present invention relates to a system and method for specifying function signatures for automated code generators transforming hierarchical models, whether in graphical or textual format, into executable functions. The process of automated code generation itself, based on a given model and function signature, is well understood by those of ordinary skill in the art. The present invention provides additional tools, in the form of regular expressions and a preview GUI, for the user to more easily and efficiently specify the function signature to be used in code generation. The example illustrations are based on the Simulink® modeling application, and Real Time Workshop®, auto-code generator, provided by The Mathworks, Inc. of Natick, Mass. The present invention, however, is not limited to use with these specific applications. Instead, the present invention has utility in the automated code generation process of a number of different model formats.

Numerous modifications and alternative embodiments of the present invention will be apparent to those skilled in the art in view of the foregoing description. Accordingly, this description is to be construed as illustrative only and is for the purpose of teaching those skilled in the art the best mode for carrying out the present invention. Details of the structure may vary substantially without departing from the spirit of the invention, and exclusive use of all modifications that come within the scope of the appended claims is reserved. It is intended that the present invention be limited only to the extent required by the appended claims and the applicable rules of law. 

1. A method for previewing executable code in an automatic code generator, comprising: a) providing a unit of a hierarchical model on a first graphical user interface (GUI); b) receiving as input from a user an initial function signature for the unit of the hierarchical model on a preview GUI; c) automatically generating a function from the unit and the initial function signature; d) dynamically displaying the initial function signature and the generated function to the user on the preview GUI; e) receiving a modified function signature for the unit from the user on the preview GUI; f) automatically generating an updated function from the unit and the modified function signature; g) dynamically displaying the modified function signature and updated function to the user on the preview GUI; and h) automatically generating code for the unit of the hierarchical model from the updated function, the code for the unit of the hierarchical model comprising the updated function corresponding to the unit of the hierarchical model and the modified function signature.
 2. The method of claim 1 wherein generating the function further comprises generating the function from the unit and the initial function signature and a stored syntax.
 3. The method of claim 2 wherein the stored syntax includes rules for regular expressions.
 4. The method of claim 3 wherein the initial function signature includes at least one regular expression.
 5. The method of claim 3 wherein the unit includes at least one regular expression.
 6. The method of claim 2 wherein the stored syntax includes rules for metacharacters.
 7. The method of claim 1 wherein the modified function includes an argument related to legacy code.
 8. The method of claim 1 wherein the unit includes at least one token.
 9. An automatic code generation system to generate code from a hierarchical model, comprising: an input device to receive as input from a user a proposed function signature for a unit of a hierarchical model provided on a first graphical user interface (GUI); a preview device to operate on the unit of the hierarchical model and the proposed function signature provided by the user to automatically produce a function; an output device to dynamically display the function and the proposed function signature to the user on a preview GUI; the input device to receive a modified function signature for the unit from the user on the preview GUI; the preview device to automatically generate an updated function from the unit and the modified function signature; the output device to dynamically display the modified function signature and updated function to the user on the preview GUI; and an automatic code generator to automatically generate code for the unit of the hierarchical model from the updated function upon receiving approval of the updated function from the user, the code for the unit of the hierarchical model comprising the updated function corresponding to the unit of the hierarchical model and the modified function signature.
 10. The automatic code generation system of claim 9 further comprising a syntax library to provide rules for the operation of the preview device.
 11. The automatic code generation system of claim 10 wherein the syntax library includes regular expression rules and wherein the proposed function signature includes at least one regular expression, the preview device able to operate on the unit and the proposed function signature with the syntax library to produce a function.
 12. The automatic code generation system of claim 9 wherein the proposed function signature includes at least one argument related to legacy code.
 13. A non-transitory computer-readable medium storing machine-executable instructions for previewing executable code in an automatic code generator, the medium storing instructions for: a) providing a unit of a hierarchical model on a first graphical user interface (GUI); b) receiving as input from a user an initial function signature for the unit of the hierarchical model on a preview GUI; c) automatically generating a function from the unit and the initial function signature; d) dynamically displaying the initial function signature and the generated function to the user on the preview GUI; e) receiving a modified function signature for the unit from the user on the preview GUI; f) automatically generating an updated function from the unit and the modified function signature; g) dynamically displaying the modified function signature and updated function to the user on the preview GUI; and h) automatically generating code for the unit of the hierarchical model from the updated function, the code for the unit of the hierarchical model comprising the updated function corresponding to the unit of the hierarchical model and the modified function signature.
 14. The medium of claim 13 wherein the instructions for generating the function further comprise instructions for generating the function from the unit and the initial function signature and a stored syntax.
 15. The medium of claim 14 wherein the stored syntax includes rules for regular expressions.
 16. The medium of claim 15 wherein the initial function signature includes at least one regular expression.
 17. The medium of claim 15 wherein the unit includes at least one regular expression.
 18. The medium of claim 14 wherein the stored syntax includes rules for metacharacters.
 19. The medium of claim 13 wherein the modified function includes an argument related to legacy code.
 20. The medium of claim 13 wherein the unit includes at least one token.
 21. An automatic code generation system to generate code from a hierarchical model, comprising: means for providing a unit of a hierarchical model on a first graphical user interface (GUI); means for receiving as input from a user an initial function signature for the unit of the hierarchical model on a preview GUI; means for automatically generating a function from the unit and the initial function signature; means for dynamically displaying the initial function signature and the generated function to the user on the preview GUI; means for receiving a modified function signature for the unit from the user on the preview GUI; means for automatically generating an updated function from the unit and the modified function signature; means for dynamically displaying the modified function signature and updated function to the user on the preview GUI; and means for automatically generating code for the unit of the hierarchical model from the updated function, the code for the unit of the hierarchical model comprising the updated function corresponding to the unit of the hierarchical model and the modified function signature. 